CSSE 230 - Data Structures and Algorithm Analysis
- Credit Hours: 3R-3L-4C
- Term Available: F,W,S
- Graduate Studies Eligible: No
- Prerequisites: MA 112, and either CSSE 220 or CSSE 221 with a grade of C or better
- Corequisites: None
This course reinforces and extends students’ understanding of current practices of producing object-oriented software. Students extend their use of a disciplined design process to include formal analysis of space/time efficiency and formal proofs of correctness. Students gain a deeper understanding of concepts from CSSE 220, including implementations of abstract data types by linear and non-linear data structures. This course introduces the use of randomized algorithms. Students design and implement software individually, in small groups, and in a challenging multi-week team project.